Sampling and Reconstruction of Periodic Piecewise Polynomials Using Sinc Kernel
نویسنده
چکیده
We address a problem of sampling and reconstructing periodic piecewise polynomials based on the theory for signals with a finite rate of innovation (FRI signals) from samples acquired by a sinc kernel. This problem was discussed in a previous paper. There was, however, an error in a condition about the sinc kernel. Further, even though the signal is represented by parameters, these explicit values are not obtained. Hence, in this paper, we provide a correct condition for the sinc kernel and show the procedure. The point is that, though a periodic piecewise polynomial of degree R is defined as a signal mapped to a periodic stream of differentiated Diracs by R+1 time differentiation, the mapping is not one-to-one. Therefore, to recover the stream is not sufficient to reconstruct the original signal. To solve this problem, we use the average of the target signal, which is available because of the sinc sampling. Simulation results show the correctness of our reconstruction procedure. We also show a sampling theorem for FRI signals with derivatives of a generic known function. key words: Piecewise polynomials, stream of Diracs, finite rate of innovation (FRI) signals, annihilating filter
منابع مشابه
Sampling signals with finite rate of innovation
Consider classes of signals which have a ̄nite number of degrees of freedom per unit of time, and call this number the rate of innovation of a signal. Examples of signals with ̄nite rate of innovation include stream of Diracs (e.g. the Poisson process), non-uniform splines and piecewise polynomials. Eventhough these signals are not bandlimited, we show that they can be sampled uniformly at (or ab...
متن کاملImage Reconstruction by Convolution with Symmetrical Piecewise th-Order Polynomial Kernels
The reconstruction of images is an important operation in many applications. From sampling theory, it is well known that the sinc-function is the ideal interpolation kernel which, however, cannot be used in practice. In order to be able to obtain an acceptable reconstruction, both in terms of computational speed and mathematical precision, it is required to design a kernel that is of finite ext...
متن کاملImage reconstruction by convolution with symmetrical piecewise nth-order polynomial kernels
The reconstruction of images is an important operation in many applications. From sampling theory, it is well known that the sine-function is the ideal interpolation kernel which, however, cannot be used in practice. In order to be able to obtain an acceptable reconstruction, both in terms of computational speed and mathematical precision, it is required to design a kernel that is of finite ext...
متن کاملDirect-Fourier reconstruction in tomography and synthetic aperture radar
We investigate the use of direct-Fourier (DF) image reconstruction in computerized tomog-raphy and synthetic aperture radar (SAR). One of our aims is to determine why the convolution-backprojection (CBP) method is favored over DF methods in tomography, while DF methods are virtually always used in SAR. We show that the CBP algorithm is equivalent to DF reconstruction using a Jacobian-weighted 2...
متن کاملA sampling theorem for periodic piecewise polynomial signals
We consider the problem of sampling signals which are not bandlimited, but still have a finite number of degrees of freedom per unit of time, such as, for example, piecewise polynomials. We demonstrate that by using an adequate sampling kernel and a sampling rate greater or equal to the number of degrees of freedom per unit of time, one can uniquely reconstruct such signals. This proves a sampl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEICE Transactions
دوره 95-A شماره
صفحات -
تاریخ انتشار 2012